Statically scoped object adaptation with expanders

Genetic Programming with Statically Scoped Local Variables

This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables are bound at time of use. An algorithm is presented for generating trees which obey this invariant, and an extension to the crossover operator is presented which preserves it. New genetic operators are described which...

Can Object-Oriented Databases be Statically Typed?

Can there be a database programming language with a type system that matches the data model? Can such a language be strongly typed? Can it be statically typed? A static type system for database programming languages is, of course, the Holy Grail of the subject. However we, the authors, who have spent some effort in searching for this venerated object, now doubt its existence and have come to be...

Improved Scheduling in Object Bases using Statically

Traditional approaches to scheduling in both object and data bases arrive at scheduling decisions based on dynamic, read/write behaviour or transaction submission order alone. Such approaches are based on exact but extremely limited information. Using static analysis, it is possible to derive more extensive but possibly inexact information. By combining the statically and dynamically derived in...

Coordination in Statically - Typed Concurrent Object

Statically-Scoped Exceptions: a Typed Foundation for Aspect-Oriented Error Handling

Aspect-oriented programming systems such as AspectJ provide mechanisms for modularizing crosscutting error-handling concerns. However, AspectJ’s advice does not integrate well with Java’s checked exception mechanism. Furthermore, conventional exception-handling facilities such as AspectJ’s share the problem of accidental exception capture due to the dynamic nature of exception-handling semantic...